Still better nonlinear codes from modular curves
نویسنده
چکیده
We give a new construction of nonlinear error-correcting codes over suitable finite fields k from the geometry of modular curves with many rational points over k, combining two recent improvements on Goppa’s construction. The resulting codes are asymptotically the best currently known.
منابع مشابه
Nonlinear codes from points of bounded height
This paper generalizes Elkies’ construction of error-correcting nonlinear codes found in [N. Elkies, Excellent nonlinear codes from modular curves, in: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, STOC’01, Hersonissos, Crete, Greece, 2001, pp. 200–208]. The generalization produces a precise average code size over codes in the new construction. The result is a larger ...
متن کاملExcellent nonlinear codes from modular curves
We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g → ∞ over a field of size q 0 yield nonlinear codes more efficient than the linear Goppa codes obtained from the same curves. These new codes now have the highest asymptotic transmission rates known for certain ranges of alphabet size and error rate. Both the theory and p...
متن کاملAlgebraic Geometric Codes over Rings
Whenever information is transmitted across a channel, errors are likely to occur. Since Shannon’s groundbreaking paper [36], coding theorists have sought to construct codes that have many codewords, that are easy to encode and decode, and that correct errors. While the main tools used in coding theory have traditionally been those of combinatorics and group theory, this volume is dedicated to c...
متن کاملRemarks on codes from modular curves: MAGMA applications
Expository paper discussing AG or Goppa codes arising from curves, first from an abstract general perspective then turning to concrete examples associated to modular curves. We will try to explain these extremely technical ideas using a special case at a level to a typical graduate student with some background in modular forms, number theory, group theory, and algebraic geometry. Many examples ...
متن کاملFinite field elements of high order arising from modular curves
In this paper, we recursively construct explicit elements of provably high order in finite fields. We do this using the recursive formulas developed by Elkies to describe explicit modular towers. In particular, we give two explicit constructions based on two examples of his formulas and demonstrate that the resulting elements have high order. Between the two constructions, we are able to genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003